Efficient and Exact Sampling of Simple Graphs with Given Arbitrary Degree Sequence
نویسندگان
چکیده
منابع مشابه
Efficient and Exact Sampling of Simple Graphs with Given Arbitrary Degree Sequence
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications ranging from epidemics, through social networks to Internet modeling. Existing graph sampling methods are either link-swap based (Markov-Chain Monte Carlo algorithms) or stub-matching based (the Configuration Model). Both t...
متن کاملOn realizing all simple graphs with a given degree sequence
We give a necessary and sufficient condition for a sequence of nonnegative integers to be realized as a simple graph’s degree sequence such that a given (but otherwise arbitrary) set of possible connections from a node are avoided. We then use this result to present a procedure that builds all simple graphs realizing a given degree sequence.
متن کاملGraphs with a Given Degree Sequence
The level set G(n, m) comprises all unlabelled simple graphs of order n and size m, and is partitioned into similarity classes, comprising all graphs with the same degree sequence. When graphs are ordered lexicographically by their signature, a unique numerical list of structural descriptors, the similarity classes of G(n, m) occur in contiguous blocks; the first graph in each similarity class ...
متن کاملRandom graphs with a given degree sequence
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have graph limits in the sense of Lovász and Szegedy with identifiable limits. This allows simple determination of other features such as the number of triangles. ...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLoS ONE
سال: 2010
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0010012